Galerkin Neural Networks: A Framework for Approximating Variational Equations with Error Control

نویسندگان

چکیده

We present a new approach to using neural networks approximate variational equations, based on the adaptive construction of sequence finite-dimensional subspaces whose basis functions are realizations networks. The can be used define standard Galerkin approximation equation. This enjoys advantages including following: sequential nature algorithm offers systematic enhancing accuracy given approximation; enhancements provide useful indicator for error that as criterion terminating updates; basic is some extent oblivious partial differential equation under consideration; and theoretical results presented regarding convergence (or otherwise) method which formulate guidelines applying method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A framework for solving functional equations with neural networks

In his „essay towards a calculus of functions“ from 1815 Charles Babbage introduced a branch of mathematics now known as the theory of functional equations [1]. But since then finding specific solutions for a given functional equation remained a hard task in many cases. For one of his examples, the now famous „Babbage equation“ φ(φ(x))=x, which solutions φ are called „the roots of identity“ and...

متن کامل

neural classifier ensemble using error-correcting output codes: access control application

abstract biometric access control is an automatic system that intelligently provides the access of special actions to predefined individuals. it may use one or more unique features of humans, like fingerprint, iris, gesture, 2d and 3d face images. 2d face image is one of the important features with useful and reliable information for recognition of individuals and systems based on this ...

A Variational Approach for Approximating Bayesian Networks by Edge Deletion

We consider in this paper the formulation of approximate inference in Bayesian networks as a problem of exact inference on an approximate network that results from deleting edges (to reduce treewidth). We have shown in earlier work that deleting edges calls for introducing auxiliary network parameters to compensate for lost dependencies, and proposed intuitive conditions for determining these p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 2021

ISSN: ['1095-7197', '1064-8275']

DOI: https://doi.org/10.1137/20m1366587